package com.liang.leetcode.dp;

// 计算路径数量
public class Lc62 {
    public static void main(String[] args) {
        Lc62 lc62 = new Lc62();
        System.out.println(lc62.uniquePaths(3,7));
        System.out.println(lc62.uniquePaths(3,2));
        System.out.println(lc62.uniquePaths(3,3));
    }

    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        dp[0][0] = 0;
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m - 1][n - 1];
    }
}
